Learnability in Optimality Theory

نویسندگان

  • Bruce Tesar
  • Paul Smolensky
  • Jane Grimshaw
  • Bruce Hayes
  • Linda Lombardi
  • Luigi Burzio
چکیده

In this article we show how Optimality Theory yields a highly general Constraint Demotion principle for grammar learning. The resulting learning procedure specifically exploits the grammatical structure of Optimality Theory, independent of the content of substantive constraints defining any given grammatical module. We decompose the learning problem and present formal results for a central subproblem, deducing the constraint ranking particular to a target language, given structural descriptions of positive examples. The structure imposed on the space of possible grammars by Optimality Theory allows efficient convergence to a correct grammar. We discuss implications for learning from overt data only, as well as other learning issues. We argue that Optimality Theory promotes confluence of the demands of more effective learnability and deeper linguistic explanation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Fate of the Consonantal Root and the Binyan in Optimality Theory

The paper provides an Optimality Theoretic account to Modern Hebrew nonconcatenative morphology. It argues that the base of derivation is the word/stem, modified by constraints assigning the prosodic structure, the vocalic pattern, and the affixes (if any). The notion of the binyan is viewed as a configuration of the structures assigned by these constraints. The consonantal root is entirely eli...

متن کامل

The Complexity of Ranking Hypotheses in Optimality Theory

Given a constraint set with k constraints in the framework of Optimality Theory (OT), what is its capacity as a classification scheme for linguistic data? One useful measure of this capacity is the size of the largest data set of which each subset is consistent with a different grammar hypothesis. This measure is known as the Vapnik-Chervonenkis dimension (VCD) and is a standard complexity meas...

متن کامل

The complexity of hypotheses in Optimality Theory

Given a constraint set with k constraints in the framework of Optimality Theory (OT), what is its capacity as a classification scheme for linguistic data? One useful measure of this capacity is the size of the largest data set (i.e. set of input-output pairs) of which each subset is consistent with a different grammar hypothesis. This metric is known as the Vapnik-Chervonenkis Dimension (VCD) a...

متن کامل

Learnability in Optimality Theory (Short Version)

A central claim of Optimality Theory is that grammars may differ only in how conflicts among universal well-formedness constraints are resolved: a grammar is precisely a means of resolving such conflicts via a strict priority ranking of constraints. It is shown here how this theory of Universal Grammar yields a highly general Constraint Demotion principle for grammar learning. The resulting lea...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995